The Complexity of Angel-Daemons and Game Isomorphism
نویسنده
چکیده
The analysis of the computational aspects of strategic situations is a basic field in Computer Sciences. Two main topics related to strategic games have been developed. First, introduction and analysis of a class of games (so called angel/daemon games) designed to asses web applications, have been considered. Second, the problem of isomorphism between strategic games has been analysed. Both parts have been separately considered.
منابع مشابه
Bounded Site Failures: An Approach to Unreliable Grid Environments
The abstract behaviour of a grid application management system can be modelled as an Orc expression in which sites are called to perform sub-computations. An Orc expression specifies how a set of site calls are to be orchestrated so as to realise some overall desired computation. In this paper evaluations of Orc expressions in untrusted environments are analysed by means of game theory. The set...
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کاملThe complexity of game isomorphism
We address the question of whether two multiplayer strategic games are equivalent and the computationalcomplexity of deciding such a property. We introduce two notions of isomorphisms, strong and weak. Each oneof those isomorphisms preserves a different structure of the game. Strong isomorphism are defined to preservethe utility functions and Nash equilibria. Weak isomorphism preser...
متن کاملTesting Graph Isomorphism in Parallel by Playing a Game
Our starting point is the observation that if graphs in a class C have low descriptive complexity, then the isomorphism problem for C is solvable by a fast parallel algorithm. More precisely, we prove that if every graph in C is definable in a finite-variable first order logic with counting quantifiers within logarithmic quantifier depth, then Graph Isomorphism for C is in TC1 ⊆ NC2. If no coun...
متن کاملPebble Games with Algebraic Rules
We define a general framework of partition games for formulating twoplayer pebble games over finite structures. We show that one particular such game, which we call the invertible-map game, yields a family of polynomial-time approximations of graph isomorphism that is strictly stronger than the well-known Weisfeiler-Lehman method. The general framework we introduce includes as special cases the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bulletin of the EATCS
دوره 107 شماره
صفحات -
تاریخ انتشار 2012